Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
201	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-10-04 12:29:59 Approximation algorithms Complexity classes Polynomial-time approximation scheme Optimization problem APX Parameterized complexity Bin packing problem PTAS reduction Theoretical computer science Applied mathematics Computational complexity theory
202	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Cuttings in 2D Revisited Timothy M. Chan∗ Given n lines in the plane, a (1/r)-cutting is a subdivision of the plane into cells such that each cell intersects Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-28 16:56:52 Mathematics Analysis of algorithms SC RL Algorithm SL Deterministic algorithm Applied mathematics Complexity classes Computer science
203	Meeting the Deadline: On the Complexity of Fault-Tolerant Continuous Gossip ∗ † Chryssis Georgiou Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:09 Analysis of algorithms Human communication Complexity classes Gossip protocol Network architecture Randomized algorithm Consensus Time complexity Distributed computing Theoretical computer science Computational complexity theory Applied mathematics
204	FA10_apps_adm_acc_new_final.xlsx Add to Reading List Source URL: grad.ucsd.edu Language: English - Date: 2014-10-31 13:42:31 Complexity classes Healthcare science Biomedical scientist Biological engineering NP Medicine Health Science
205	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics
206	Partial Information Network QueriesI Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi∗ Department of Computer Science, Technion - Israel Institute of Technology, Haifa 32000, Israel Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-11-30 12:10:08 Applied mathematics Tree decomposition NP-hard NP Theoretical computer science Graph theory Complexity classes
207	How to detect and quantify inefficient use of nutrients in livestock systems? Jaap Schröder (Agrosystems Research, Plant Research International, Wageningen; ) Add to Reading List Source URL: www.livestockdialogue.org Language: English - Date: 2012-04-02 08:59:07 Agriculture Productivity PP P Theoretical computer science Complexity classes Applied mathematics
208	Why is P Not Equal to N P ? ? Michael Fellows1,2 and Frances Rosamond1 1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:05:44 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory Parameterized complexity P versus NP problem NP-complete NP-hard NP Theoretical computer science Computational complexity theory Applied mathematics
209	FA10_apps_adm_acc_new.xlsx Add to Reading List Source URL: grad.ucsd.edu Language: English - Date: 2014-10-31 13:42:31 Complexity classes NP Healthcare science Biomedical scientist Biological engineering Medicine Health Science
210	CS 373 Final Exam (December 15, 2000) Fall 2000 Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:10 Complexity classes NP-complete problems Mathematical optimization NP-hard Time complexity NP Independent set P versus NP problem Clique Theoretical computer science Computational complexity theory Applied mathematics